منابع مشابه
Exact bounds for some hypergraph saturation problems
Let Wn(p, q) denote the minimum number of edges in an n× n bipartite graph G on vertex sets X,Y that satisfies the following condition; one can add the edges between X and Y that do not belong to G one after the other so that whenever a new edge is added, a new copy of Kp,q is created. The problem of bounding Wn(p, q), and its natural hypergraph generalization, was introduced by Balogh, Bollobá...
متن کاملHypergraph sequences as a tool for saturation of ultrapowers
Let T1, T2 be countable first-order theories, Mi |= Ti, and D any regular ultrafilter on λ ≥ א0. A longstanding open problem of Keisler asks when T2 is more complex than T1, as measured by the fact that for any such λ,D, if the ultrapower (M2)/D realizes all types over sets of size ≤ λ, then so must the ultrapower (M1)/D. In this paper, building on the author’s prior work [11] [12] [13], we sho...
متن کاملHandling Irregularities in ROADRUNNER
We report on some recent advancements on the development of the ROADRUNNER system, which is able to automatically infer a wrapper for HTML pages. One of the major drawbacks of the ROADRUNNER approach was its limited ability in handling irregularities in the source pages. To overcome this issue, we have developed a technique to deal with chunks of unstructured HTML code. Several experiments have...
متن کاملIrregularities of Distribution, Ii
(1.2) \D[zu ..., zn ; B(x, r)]\ > c2(K, e). n < Note that the exponent {\ — (1/2K) e) of n is essentially the best possible: (2 — (1/2K) e) cannot be replaced by the exponent (2 — (1/2K) + e) with e > 0. Note further that (1.1) or (1.2) above guarantees the existence of a ball in U with 'error' very large as compared to that of boxes in U with sides parallel to the axes. We recall that in 1954 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2018
ISSN: 1077-8926
DOI: 10.37236/7727